FiEstAS sampling—a Monte Carlo algorithm for multidimensional numerical integration
نویسندگان
چکیده
منابع مشابه
FiEstAS sampling -- a Monte Carlo algorithm for multidimensional numerical integration
This paper describes a new algorithm for Monte Carlo integration, based on the Field Estimator for Arbitrary Spaces (FiEstAS). The algorithm is discussed in detail, and its performance is evaluated in the context of Bayesian analysis, with emphasis on multimodal distributions with strong parameter degeneracies. Source code is available upon request.
متن کاملMonte-Carlo and Quasi-Monte-Carlo Methods for Numerical Integration
We consider the problem of numerical integration in dimension s, with eventually large s; the usual rules need a very huge number of nodes with increasing dimension to obtain some accuracy, say an error bound less than 10−2; this phenomenon is called ”the curse of dimensionality”; to overcome it, two kind of methods have been developped: the so-called Monte-Carlo and Quasi-Monte-Carlo methods. ...
متن کاملNumerical Integration and Monte Carlo Integration
Here we will begin by deriving the basic trapezoidal and Simpson’s integration formulas for functions that can be evaluated at all points in the integration range, i.e, there are no singularities in this range. We will also show how the remaining discretization errors present in these low-order formulas can be systematically extrapolated away to arbitrarily high order; a method known as Romberg...
متن کاملMonte Carlo Method for Numerical Integration Based on Sobol's Sequences
An efficient Monte Carlo method for multidimensional integration is proposed and studied. The method is based on Sobol’s sequences. Each random point in s-dimensional domain of integration is generated in the following way. A Sobol’s vector of dimension s (ΛΠτ point) is considered as a centrum of a sphere with a radius ρ. Then a random point uniformly distributed on the sphere is taken and a ra...
متن کاملA New Quasi-Monte Carlo Algorithm for Numerical Integration of Smooth Functions
Bachvalov proved that the optimal order of convergence of a Monte Carlo method for numerical integration of functions with bounded kth order derivatives is O ( N− k s − 2 ) , where s is the dimension. We construct a new Monte Carlo algorithm with such rate of convergence, which adapts to the variations of the sub-integral function and gains substantially in accuracy, when a low-discrepancy sequ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2008
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2008.07.011